Composite clustering normal distribution transform algorithm
نویسندگان
چکیده
منابع مشابه
Clustering Multivariate Gaussians for Normal Distribution Transform Grids
3D maps including urban structures and terrain information facilitate urban searches for robots operating in various robot scenarios. However it suffers from large memory requirements and computation time to deal with point clouds collected by range sensors. It is problematic for operating rescue robots in real time. NDT (Normal Distribution Transform) grid is a suitable map model to deal with ...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
New Clustering Algorithm ‘TCEVR’ for Vector Quantization using Cosine Transform
Vector Quantization (VQ) plays important role in codebook generation such that the distortion between the original image and the reconstructed image is the minimum. In this paper we present an effective clustering algorithm to generate codebook for vector quantization. In existing algorithm KEVR while splitting the cluster every time new orientation is introduced using error vector sequence. Th...
متن کاملNormal families and value distribution in connection with composite functions
We prove a value distribution result which has several interesting corollaries. Let k ∈ N, let α ∈ C and let f be a transcendental entire function with order less than 1/2. Then for every nonconstant entire function g, we have that (f ◦ g) −α has infinitely many zeros. This result also holds when k = 1, for every transcendental entire function g. We also prove the following result for normal fa...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Robotic Systems
سال: 2020
ISSN: 1729-8814,1729-8814
DOI: 10.1177/1729881420912142